package leetCode.q23;

public class Me {
    public class ListNode {
        int val;
        ListNode next;
        ListNode() {}
        ListNode(int val) { this.val = val; }
        ListNode(int val, ListNode next) { this.val = val; this.next = next; }
    }

    public ListNode mergeKLists(ListNode[] lists) {
        ListNode res = null;
        for(int i=0;i< lists.length;i++){
            res = this.merge(res,lists[i]);
        }

        return res;
    }

    public ListNode merge(ListNode l1,ListNode l2){
        ListNode head = new ListNode(),cur = head;

        while (l1!=null&&l2!=null){
            if(l1.val < l2.val){
                cur.next = l1;
                l1 = l1.next;
            }else {
                cur.next = l2;
                l2 = l2.next;
            }
            cur = cur.next;
        }
        if(l1!=null) cur.next = l1;
        if(l2!=null) cur.next = l2;
        return head.next;
    }
}
